A Bijection for Enriched Trees
نویسندگان
چکیده
منابع مشابه
A Simple Bijection between Binary Trees and Colored Ternary Trees
In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.
متن کاملA bijection between planar constellations and some colored Lagrangian trees
Constellations are colored planar maps that generalize different families of maps (planar maps, bipartite planar maps, bi-Eulerian planar maps, planar cacti, . . . ) and are strongly related to factorizations of permutations. They were recently studied by Bousquet-Mélou and Schaeffer [9] who describe a correspondence between these maps and a family of trees, called Eulerian trees. In this paper...
متن کاملA Strahler bijection between Dyck paths and planar trees
The Strahler number of binary trees has been introduced by hydrogeologists and rediscovered in computer science in relation with some optimization problems. Explicit expressions have been given for the Strahler distribution, i.e. binary trees enumerated by number of vertices and Strahler number. Two other Strahler distributions have been discovered with the logarithmic height of Dyck paths and ...
متن کاملA New Bijection between Natural Numbers and Rooted Trees∗
A bijection is defined recursively between the set of natural numbers and the set of finite rooted trees. It is based on the prime decomposition of a natural number and the rank of a prime. This bijection leads naturally to a canonical presentation of rooted trees. For trees in each of two classes, bounds are given for the number of nodes in terms of the number assigned to the tree.
متن کاملA simple bijection between a subclass of 2-binary trees and ternary trees
). In this note we provide another bijection, which is simpler. Furthermore, it preserves more of the structure of the tree. The basic idea is that, when • ◦ is forbidden, any sequence of nodes connected by right edges must have labels white . . . white, followed by black . . . black. We translate the restricted 2-binary tree recursively into a ternary tree from the root to the leaves, by leavi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1994
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1038